home *** CD-ROM | disk | FTP | other *** search
- Path: nntp.teleport.com!sabre
- From: sabre@teleport.com (Chris Lattner)
- Newsgroups: alt.3d,comp.graphics.algorithms,comp.sys.amiga.programmer,rec.games.programmer
- Subject: Re: Fast line algorithm
- Date: 8 Feb 1996 22:06:47 GMT
- Organization: Teleport - Portland's Public Access (503) 220-1016
- Message-ID: <4fds5n$qs1@maureen.teleport.com>
- References: <4fa2ba$ssl@fdmetd.fdata.no>
- NNTP-Posting-Host: linda.teleport.com
- X-Newsreader: TIN [version 1.2 PL2]
-
- : For a while I've been using the Bresenham line-algorithm for drawing
- : lines. Now I've read somewhere that there exists an algorithm called
- : 'Symmetric double-step' (by Wu) that could be 3x-4x faster . Does
- : anybody know where to get this algorithm, alternatively a routine that
- : is faster than Bresenham?
-
- On my web page, I go into great detail about fast lines... Check out the
- graphics programming series:
-
- _.,-*~'`^`'~*-,._.,-*~'`^`'~*-,._.,-*~'`^`'~*-,._.,-*~'`^`'~*-,._
- Chris | Home page: http://www.teleport.com/~sabre
- Lattner | For all your PC programming needs! Articles,
- My Propaganda-> | reference, links, EVERYTHING!
- ^`'~*-,._.,-*~'`^`'~*-,._.,-*~'`^`'~*-,._.,-*~'`^`'~*-,._.,-*~'`^
-